Adaptive Routing in Irregular Networks Using Cut-Through Switches

Many cut-through switches, which can greatly reduce network latency, are commercially available for the construction of high-speed local area networks. The in-terconnection of cut-through switches provides an excellent network platform for high-performance workstation clusters. A novel deadlock-free adaptive routing algorithm is proposed to allow irregular intercon-nection of cut-through switches. The adaptive routing algorithm is based on two unidirectional adaptive trails constructed from two opposite unidirectional Eu-lerian trails. Some heuristics are suggested in terms of the selection of Eulerian trails, the avoidance of long routing paths, and the degree of adaptivity. Extensive simulation experiments based on a more realistic-nite input source model are conducted to evaluate the network performance under diierent network parameters and traac conditions. Both bimodal and bursty messages are considered. Such switch-based irregular networks are truly incrementally scalable and have potential to be reconngured to adapt to the dynamics of network traac conditions.